Ação popular

Popular and Clan-Popular b-Matchings

Suppose that each member of a set of agents has a preference list of a subset of houses, possibly involving ties, and each agent and house has their capacity denoting the maximum number of houses/agents (respectively) that can be matched to him/her/it. We want to find a matching M , called popular, for which there is no other matching M ′ such that more agents prefer M ′ to M than M to M ′, sub...

Popular astronomy.

The Springer-Praxis Popular Astronomy programme covers the latest observations, techniques and discoveries in astronomy, astrophysics and cosmology, selecting key topics designed to fire the imagination of keen astronomers everywhere. Many of the topics selected for titles in this programme are refreshingly new, and away from the accepted mainstream of titles published in this area. Topics inc...

"popular" Science.

Popular Ranking

How do you aggregate the preferences of multiple agents in a fair manner? This is a question that has occupied researchers for several centuries. Suppose we have k voters who each give their preferences on n candidates. How should the candidates be ranked to best represent the input? Marquis de Condorcet [5] showed that there may not exist a “winner”: a candidate who beats all other candidates ...

Popular astronomy.

The Springer-Praxis Popular Astronomy programme covers the latest observations, techniques and discoveries in astronomy, astrophysics and cosmology, selecting key topics designed to fire the imagination of keen astronomers everywhere. Many of the topics selected for titles in this programme are refreshingly new, and away from the accepted mainstream of titles published in this area. Topics inc...